Hermitian Self-Dual Cyclic Codes of Length $p^a$ over $GR(p^2, s)$
نویسندگان
چکیده
In this paper, we study cyclic codes over the Galois ring GR(p, s). The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length pa over GR(p, s). Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over GR(p, s). Some corrections to results on Euclidean self-dual cyclic codes of even length over Z4 in Discrete Appl. Math. 128, (2003), 27 and Des. Codes Cryptogr. 39, (2006), 127 are provided.
منابع مشابه
On Euclidean and Hermitian Self-Dual Cyclic Codes over $\mathbb{F}_{2^r}$
Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing [5] as well as Kai and Zhu [7] proved that Euclidean self-dual cyclic codes of length n over Fq exist if and only if n is even and q = 2 , where r is any positive integer. For n and q even, there always exists an [n, n 2 ] self-dual cyclic code with generator polynomial x n 2 + 1 called the trivial se...
متن کاملA note on cyclic codes over GR(p 2, m) of length p k
The number of self-dual cyclic codes of length pk over GR(p2,m) is determined by the nullity of a certain matrix M(pk, i1). With the aid of Genocchi numbers, we determine the nullity of M(pk, i1) and hence determine completely the number of such codes.
متن کاملLeft dihedral codes over Galois rings ${\rm GR}(p^2,m)$
Let D2n = 〈x, y | x = 1, y = 1, yxy = x〉 be a dihedral group, and R = GR(p, m) be a Galois ring of characteristic p and cardinality p where p is a prime. Left ideals of the group ring R[D2n] are called left dihedral codes over R of length 2n, and abbreviated as left D2n-codes over R. Let gcd(n, p) = 1 in this paper. Then any left D2n-code over R is uniquely decomposed into a direct sum of conca...
متن کاملConstruction of quasi-cyclic self-dual codes
There is a one-to-one correspondence between l-quasi-cyclic codes over a finite field Fq and linear codes over a ring R = Fq[Y ]/(Y m − 1). Using this correspondence, we prove that every l-quasi-cyclic self-dual code of length ml over a finite field Fq can be obtained by the building-up construction, provided that char (Fq) = 2 or q ≡ 1 (mod 4), m is a prime p, and q is a primitive element of F...
متن کاملHermitian self-dual quasi-abelian codes
Quasi-abelian codes constitute an important class of linear codes containing theoretically and practically interesting codes such as quasi-cyclic codes, abelian codes, and cyclic codes. In particular, the sub-class consisting of 1-generator quasi-abelian codes contains large families of good codes. Based on the well-known decomposition of quasi-abelian codes, the characterization and enumeratio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1401.6634 شماره
صفحات -
تاریخ انتشار 2014